Fully decoupled time-marching schemes for incompressible fluid/thin-walled structure interaction
نویسندگان
چکیده
منابع مشابه
A fully decoupled scheme for the interaction of a thin - walled structure with an incompressible fluid 1
In this note we propose a class of fully decoupled schemes (velocity-pressure-displacement splitting) for the coupling of an incompressible fluid with a thin-walled structure. The time splitting is achieved by combining an overall fractional-step time-marching of the system with a specific Robin-Neumann treatment of the interface coupling. The two variants considered yield unconditional stabili...
متن کاملDisplacement-velocity correction schemes for incompressible fluid-structure interaction
We propose a new class of time-marching schemes for the explicit coupling of an incompressible fluid and an elastic solid (not necessarily thin). We state a general energy-based stability result and illustrate the accuracy of the different variants in a numerical benchmark. To cite this article: A. Name1, A. Name2, C. R. Acad. Sci. Paris, Ser. I 340 (2005).
متن کاملIncremental displacement-correction schemes for incompressible fluid-structure interaction
In this paper we introduce a class of incremental displacement-correction schemes for the explicit coupling of a thin-structure with an incompressible fluid. These methods enforce a specific Robin-Neumann explicit treatment of the interface coupling. We provide a general stability and convergence analysis that covers both the incremental and the non-incremental variants. Their stability propert...
متن کاملFully Conservative Higher Order Finite Difference Schemes for Incompressible Flow
Conservation properties of the mass, momentum, and kinetic energy equations for incompressible flow are specified as analytical requirements for a proper set of discrete equations. Existing finite difference schemes in regular and staggered grid systems are checked for violations of the conservation requirements and a few important discrepancies are pointed out. In particular, it is found that ...
متن کاملFully Polynomial Time Approximation Schemes
Recall that the approximation ratio for an approximation algorithm is a measure to evaluate the approximation performance of the algorithm. The closer the ratio to 1 the better the approximation performance of the algorithm. It is notable that there is a class of NP-hard optimization problems, most originating from scheduling problems, for which there are polynomial time approximation algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2015
ISSN: 0021-9991
DOI: 10.1016/j.jcp.2015.05.009